Universal lossless source coding with the Burrows Wheeler transform
نویسندگان
چکیده
منابع مشابه
Universal Lossless Source Coding with the Burrows Wheeler Transform
The Burrows Wheeler Transform (BWT) is a reversible sequence transformation used in a variety of practical lossless source-coding algorithms. In each, the BWT is followed by a lossless source code that attempts to exploit the natural ordering of the BWT coefficients. BWT-based compression schemes are widely touted as low-complexity algorithms giving lossless coding rates better than those of th...
متن کاملTree Source Identification with the Burrows Wheeler Transform
We study the identification of a tree source model from a given sequence produced by the source. The Burrows Wheeler transform (BWT) is a reversible block-sorting sequence transformation with O(N) complexity, which rearranges symbols according to the lexicographical order of their contexts. For a tree source, symbols at the BWT output are sorted according to the states in the tree, so the BWT o...
متن کاملDynamic Burrows-Wheeler Transform
The Burrows-Wheeler Transform is a building block for many text compression applications and self-index data structures. It reorders the letters of a text T to obtain a new text bwt(T ) which can be better compressed. This forward transform has been intensively studied over the years, but a major problem still remains: bwt(T ) has to be entirely recomputed whenever T is modified. In this articl...
متن کاملAttacking Scrambled Burrows-Wheeler Transform
Scrambled Burrows-Wheeler transform [6] is an attempt to combine privacy (encryption) and data compression. We show that the proposed approach is insecure. We present chosen plaintext and known plaintext attacks and estimate their complexity in various scenarios.
متن کاملSyllable-Based Burrows-Wheeler Transform
The Burrows-Wheeler Transform (BWT) is a compression method which reorders an input string into the form, which is preferable to another compression. Usually Move-To-Front transform and then Huffman coding is used to the permutated string. The original method [3] from 1994 was designed for an alphabet compression. In 2001, versions working with word and n-grams alphabet were presented. The newe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2002
ISSN: 0018-9448
DOI: 10.1109/18.995542